The division problem with maximal capacity constraints
نویسندگان
چکیده
منابع مشابه
The division problem under constraints
The division problem under constraints consists of allocating a given amount of an homogeneous and perfectly divisible good among a subset of agents with singlepeaked preferences on an exogenously given interval of feasible allotments. We characterize axiomatically the family of extended uniform rules proposed to solve the division problem under constraints. Rules in this family extend the unif...
متن کاملThe Adwords Problem with Strict Capacity Constraints
We study an online assignment problem where the offline servers have capacities, and the objective is to obtain a maximum-weight assignment of requests that arrive online. The weight of edges incident to any server can be at most the server capacity. Our problem is related to the adwords problem, where the assignment to a server is allowed to exceed its capacity. In many applications, however, ...
متن کاملMaximal covering location-allocation problem with M/M/k queuing system and side constraints
We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...
متن کاملHub Covering Location Problem Considering Queuing and Capacity Constraints
In this paper, a hub covering location problem is considered. Hubs, which are the most congested part of a network, are modeled as M/M/C queuing system and located in placeswhere the entrance flows are more than a predetermined value.A fuzzy constraint is considered in order to limit the transportation time between all origin-destination pairs in the network.On modeling, a nonlinear mathematica...
متن کاملThe Separability Principle for the Division Problem with Participation Constraints
We study a division problem which allocates resources to agents with single-peaked preferences, who have a right to decide for the participation. We introduce the generalized uniform rule which assigns resources to agent as equally as possible subject to the participation constraints. We present various characterizations of the generalized uniform rule on the basis of separability principle.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SERIEs
سال: 2011
ISSN: 1869-4187,1869-4195
DOI: 10.1007/s13209-011-0055-6